Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
791	Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the art Oded Goldreich Abstract. The purpose of this article is to correct the inaccurate account of this subject that is provided Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-07-22 08:07:12 Cryptographic protocols Computational complexity theory Proof theory Complexity classes Combinatorics Interactive proof system IP Soundness Non-interactive zero-knowledge proof Theoretical computer science Cryptography Applied mathematics
792	Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-07-15 06:05:48 Complexity classes Computational problems Operations research Optimization problem NP Approximation algorithms Mathematical optimization Time complexity Decision problem Theoretical computer science Computational complexity theory Applied mathematics
793	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-10-13 17:17:56 Computational complexity theory Abstract algebra Linear algebra NP-complete problems Logic in computer science Boolean satisfiability problem Time complexity PP Element distinctness problem Theoretical computer science Mathematics Algebra
794	Syntactic Characterizations of Polynomial Time Optimization Classes Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-07-07 17:48:07 Computational problems Computational complexity theory Operations research Optimization problem Mathematical optimization Approximation algorithm NP Decision problem Polynomial-time approximation scheme Theoretical computer science Applied mathematics Complexity classes
795	Egon Borger Erich Gradel Yuri Gurevich The Classical Decision Problem Add to Reading List Source URL: www.gbv.de Language: English - Date: 2007-11-05 08:28:23 Computability theory Model theory Complexity classes Metalogic Proof theory Decision problem Decidability Satisfiability First-order logic Theoretical computer science Computational complexity theory Mathematical logic
796	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University May 23, 2008 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-12 00:13:50 Complexity classes Boolean algebra Constraint programming Mathematical optimization Boolean satisfiability problem Constraint satisfaction problem NP-complete Belief propagation NP Theoretical computer science Computational complexity theory Applied mathematics
797	Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?∗ Hirotada Kobayashia b † Keiji Matsumotoa b ‡ Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2009-07-17 07:53:04 Quantum complexity theory Quantum information science Models of computation QMA Interactive proof system PP IP Soundness Quantum computer Theoretical computer science Applied mathematics Computational complexity theory
798	Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the diﬀerent versions are combined into one Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-02 09:14:39 Uriel Feige NP-complete problems Computational complexity theory Adi Shamir Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Symposium on Foundations of Computer Science Approximation algorithm Uriel Theoretical computer science Applied mathematics Mathematics
799	Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:28:02 NP-complete problems Set cover problem Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
800	Interactive proofs with efficient quantum prover for recursive Fourier sampling Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-09-21 16:35:50 Computational complexity theory Interactive proof system IP Quantum algorithm BQP Quantum computer PP NP Soundness Theoretical computer science Applied mathematics Quantum complexity theory

UPDATE